Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
621	From the book Networks, Crowds, and Markets: Reasoning about a Highly Connected World. By David Easley and Jon Kleinberg. Cambridge University Press, 2010. Complete preprint on-line at http://www.cs.cornell.edu/home/klei Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2010-06-10 15:11:53 Triadic closure Triangle Flow network Graph Signed graph Binary tree Graph theory Mathematics Sociology
622	Acknowledgements Organising a workshop (however small) is a job that involves a lot of organisation. This workshop is no exception. There have been many people involved and we would like to take this opportunity to thank Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:08 Random regular graph Neighbourhood NP-complete problems Graph coloring Planar graphs Expander graph Graph theory Connectivity Graph
623	Preprint. To appear in Algorithmica. DOIs00453 – Online available. On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion Nadja Betzler1 · Hans L. Bodlaender · Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-10-16 08:46:15 NP-complete problems Graph operations Analysis of algorithms Parameterized complexity Feedback vertex set Tree decomposition Vertex cover Dominating set Kernelization Graph theory Theoretical computer science Mathematics
624	Preprint. To appear in Data Mining and Knowledge Discovery. DOIs10618 – Online available. The Effect of Homogeneity on the Computational Complexity of Combinatorial Data Anonymization Robert Bredere Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-10-16 08:46:46 Analysis of algorithms Parameterized complexity Time complexity Anonymity Matrix NP-complete problems Theoretical computer science Computational complexity theory Applied mathematics
625	Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges Robert Bredereck1 , Jiehua Chen1 , Piotr Faliszewski2 , Jiong Guo3 , Rolf Niedermeier1 , and Gerhard J. Woeginger4 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-12-01 07:16:49 Analysis of algorithms NP-complete problems Complexity classes Parameterized complexity Kernelization Vertex cover Time complexity Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
626	Parameterized Regular Expressions and Their Languages Pablo Barceló1 , Leonid Libkin2 , and Juan L. Reutter2 1 2 Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2011-09-27 14:42:30 Applied mathematics Automata theory EXPSPACE Regular language Regular expression Model theory PSPACE-complete FO Symbol Theoretical computer science Formal languages Complexity classes
627	Willson Algorithms for Molecular Biology 2012, 7:13 http://www.almob.org/contentRESEARCH Open Access Add to Reading List Source URL: www.almob.org Language: English Complexity classes NP-complete problems Mathematical optimization NP P versus NP problem Graph Tree Directed graph Theoretical computer science Computational complexity theory Mathematics
628	How to Put Through Your Agenda in Collective Binary Decisions? Noga Alon1 , Robert Bredereck2 , Jiehua Chen2 , Stefan Kratsch2 Rolf Niedermeier2 , and Gerhard J. Woeginger3 2 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-10-23 10:13:29 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Mathematical optimization Vertex cover Dominating set Time complexity FO Theoretical computer science Computational complexity theory Applied mathematics
629	Discrete Comput Geom: 701–722 DOIs00454z Minimum Manhattan Network is NP-Complete Francis Y.L. Chin · Zeyu Guo · He Sun Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2011-05-04 06:25:07 Microsoft Gadgets Computing Computational complexity theory Gadget Struct
630	Interval Scheduling and Colorful Independent Sets Ren´e van Bevern1,∗ , Matthias Mnich2 , Rolf Niedermeier1 , and Mathias Weller1,† 1 Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-11-07 08:24:33 Clique Interval graph Independent set Claw-free graph Matching Cograph Path decomposition Maximal independent set Graph theory NP-complete problems Graph operations

UPDATE